A Generalized Convolution for Finite Fourier Transformations
نویسنده
چکیده
Presented to the Society, April 16, 1948; received by the editors June 25, 1948. 1 The author wishes to thank Professor R. V. Churchill for his advice in the preparation of this paper. The content of this paper is part of a dissertation submitted in partial fulfillment of the requirements for the degree of doctor of philosophy in the University of Michigan. 2 The numbers in brackets refer to the bibliography.
منابع مشابه
A generalized Fourier transform and convolution on time scales
In this paper, we develop some important Fourier analysis tools in the context of time scales. In particular, we present a generalized Fourier transform in this context as well as a critical inversion result. This leads directly to a convolution for signals on two (possibly distinct) time scales as well as several natural classes of time scales which arise in this setting: dilated, closed under...
متن کاملOptimal Filter Partitions for Real-time Fir Filtering Using Uniformly-partitioned Fft-based Convolution in the Frequency-domain
This paper concerns highly-efficient real-time FIR filtering with low input-to-output latencies. For this type of application, partitioned frequency-domain convolution algorithms are established methods, combining efficiency and the necessity of low latencies. Frequency-domain convolution realizes linear FIR filtering by means of circular convolution. Therefore, the frequency transform’s period...
متن کاملOn Applications of the Generalized Fourier Transform in Numerical Linear Algebra
Matrices equivariant under a group of permutation matrices are considered. Such matrices typically arise in numerical applications where the computational domain exhibits geometrical symmetries. In these cases, group representation theory provides a powerful tool for block diagonalizing the matrix via the Generalized Fourier Transform. This technique yields substantial computational savings in ...
متن کاملA Harmonical Model for Approximating the Identity in Min-Plus Convolution
Min-plus convolution is an algebra system that has applications to computer networks. Mathematically, the identity of min-plus convolution plays a key role in theory. On the other hand, the mathematical representation of the identity, which is computable with digital computers, is essential for further developing min-plus convolution (e.g., de-convolution) in practice. However, the identical el...
متن کاملOn Fourier Type Integral Transform for a Class Of Generalized Quotients
In this paper, we investigate certain spaces of generalized functions for the Fourier and Fourier type integral transforms. We discuss convolution theorems and establish certain spaces of distributions for the considered integrals. The new Fourier type integral is well-defined, linear, one-to-one and continuous with respect to certain types of convergences. Many properties and an inverse proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007